Performance Analysis of Gateways with Buffer Constraints
نویسندگان
چکیده
The performance of interconnected networks is highly depenht on the performance of the gateways. Since the finite storage capability of gateways effects the throughput it has to be considered for the analysis of interwnnected networks. Different configurations of networks are studied: i) Gateways and the channels of local area networks have no buffer capacity constraints, ii) Only gateways have buffer capacity constraints. iii) Only the channels of local area networks have buffer capacity constraints. iv) Both gateways and the channels of the local area networks have buffer capacity constraints. An approximation method is introduced which allows to compute the throughput for the above network configurations. Examples are given to demonstrate the impacts of gateway buffer capacity on the performance of the network Approximate results are compared and validated by simulation.
منابع مشابه
Improving for Drum_Buffer_Rope material flow management with attention to second bottlenecks and free goods in a job shop environment
Drum–Buffer–Rope is a theory of constraints production planning methodology that operates by developing a schedule for the system’s first bottleneck. The first bottleneck is the bottleneck with the highest utilization. In the theory of constraints, any job that is not processed at the first bottleneck is referred to as a free good. Free goods do not use capacity at the first bottleneck, so very...
متن کاملANALYSIS OF FINITE BUFFER RENEWAL INPUT QUEUE WITH BALKING AND MARKOVIAN SERVICE PROCESS
This paper presents the analysis of a renewal input finite buffer queue wherein the customers can decide either to join the queue with a probability or balk. The service process is Markovian service process ($MSP$) governed by an underlying $m$-state Markov chain. Employing the supplementary variable and imbedded Markov chain techniques, the steady-state system length distributions at pre...
متن کاملA novel mathematical model for a hybrid flow shop scheduling problem under buffer and resource limitations-A case study
Scheduling problems play a big role in manufacturing and planning the production for increasing the production efficiency and assigning the resources to operations. Furthermore, in many manufacturing systems there is a physical space between stages that called intermediate buffers. In this study, a model is proposed for minimizing the makespan of a hybrid flow shop scheduling problem with inter...
متن کاملSchedulability analysis and optimisation for the synthesis of multi-cluster distributed embedded systems
An approach to schedulability analysis for the synthesis of multi-cluster distributed embedded systems consisting of time-triggered and event-triggered clusters, interconnected via gateways, is presented. A buffer size and worst case queuing delay analysis for the gateways, responsible for routing inter-cluster traffic, is also proposed. Optimisation heuristics for the priority assignment and s...
متن کاملModeling and Performance Analysis of Dynamic Random Early Detection (DRED) Gateway for Congestion Avoidance
One of the most prominent congestion avoidance schemes in the Internet architecture is the Random Early Detection (RED) algorithm. Several modifications and enhancements have been made to the original RED so as to make it more responsive to congestion avoidance at the gateways. In this paper, we introduced the Dynamic Random Early Detection (DRED) model, which uses a newly introduced parameter ...
متن کامل